翻訳と辞書 Words near each other ・ Frequency-division multiple access ・ Frequency-division multiplexing ・ Frequency-doubling illusion ・ Frequency-exchange signaling ・ Frequency-hopping spread spectrum ・ Frequency-locked loop ・ Frequency-resolved optical gating ・ Frequency-shift keying ・ Frequent Communion ・ Frequent confession ・ Frequent Death ・ Frequent deliveries ・ Frequent flyer (disambiguation) ・ Frequent Flyer (film) ・ Frequent flyer program (Guantanamo) ・ Frequent subtree mining ・ Frequent urination ・ Frequent-flyer program ・ Frequentative ・ Frequentis ・ Frequentist inference ・ Frequentist probability ・ Frequently Asked Questions About Time Travel ・ Frera ・ Freraea ・ Frere ・ Frere baronets ・ Frere Hall ・ Frere Hospital ・ Frere Street Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Frequent subtree mining ： ウィキペディア英語版 Frequent subtree mining In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of occurrences in other subtrees) is over a given threshold. It is a more general form of the maximum agreement subtree problem. == Definition == Frequent subtree mining is the problem of trying to find all of the patterns whose "support" is over a certain user-specified level, where "support" is calculated as the number of trees in a database which have at least one subtree isomorphic to a given pattern.〔Dai, H., Srikant, R. and Zhang, C. (2004). "(Advances in Knowledge Discovery and Data Mining. )" ''8th Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, May 26–28, 2004, Proceedings''. 1st ed. p. 65.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Frequent subtree mining」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.